中庭防排烟系统性能化设计探析

阐述中庭防排烟性能化设计的具体过程 ,并对防排烟系统设计的运用进行举例。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于主观贝叶斯方法的装备故障概率分析

由于造成武器装备故障的环境因素以及装备自身结构特征的不同，导致装备发生故障的不确定性。本文讨论了基于主观贝叶斯方法的装备故障概率分析方法，旨在事先预测武器装备在执行任务过程中的故障概率，为合理制定装备保障方案提供辅助决策依据。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Production to order and off‐line inspection when the production process is partially observable

This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

反导作战信息流时延模型研究

在现代防空反导作战中,战术弹道导弹的威胁,给防空系统带来了预警时间不足等一些新的问题。为了提高防空系统的反导预警能力,在对反导作战过程和反导预警作战过程进行分析的基础之上,对反导预警信息流程进行了研究。提出了一种边处理-边分发的实时模式,通过对比分析,所提模型缩短了预警信息的传输时间,使作战部队提前预警。     

一种快速确定导弹火力需求量的方法

快速火力需求分析是武器装备使用与保障所面临的重要问题.基于打击单目标情况,首先引入毁伤概率作为导弹火力需求指标,提出了考虑射程影响时的3种CEP快速计算模型,并利用概率论与飞行器试验统计的相关知识建立了一套比较完善的确定导弹火力需求量的方法.最后的计算结果表明该方法是行之有效的.     

H∞控制在机载光电跟瞄系统中的应用

机载光电跟瞄系统是一个受多种干扰影响的高阶复杂系统,其对系统的鲁棒性和抗干扰能力要求很高.H∞控制的特点是鲁棒性好,因此在对机载光电跟瞄系统研究的基础上,以方位回路的稳定控制为例建立数学模型,应用H∞控制和Kalman滤波相结合的方法设计控制器.仿真研究表明H∞控制器的控制效果良好,特别是模型参数摄动又有多种干扰作用时,性能虽稍有下降,但仍能有效跟踪.     

军民两用技术开发与贸易的制约因素和发展趋势

军民两用技术因其在军用与民用领域的广泛适用性及巨大的经济价值受到各国政府的高度重视。研究军民两用技术开发与贸易的制约因素和发展趋势对于我国正在进行的军工体系改革以及整个国民经济的发展,都将具有极大的意义。